A Fractal Evolutionary Particle Swarm Optimizer
نویسندگان
چکیده
A Fractal Evolutionary Particle Swarm Optimization (FEPSO) is proposed based on the classical particle swarm optimization (PSO) algorithm. FEPSO applies the fractal Brownian motion model used to describe the irregular movement characteristics to simulate the optimization process varying in unknown mode, and include the implied trends to go to the global optimum. This will help the individual to escape from searching optimum too randomly and precociously. Compared with the classical PSO algorithm, each particle contains a fractal evolutionary phase in FEPSO. In this phase, each particle simulates a fractal Brownian motion with an estimated Hurst parameter to search the optimal solution in each sub dimensional space, and update correspond sub location. The simulation experiments show that this algorithm has a robust global search ability for most standard composite test functions. Its optimization ability performs much better than most recently proposed improved algorithm based on PSO.
منابع مشابه
A Modified Particle Swarm Optimizer - Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., Th
In this paper, we introduce a new parameter, called inertia weight, into the original particle swarm optimizer. Simulations have been done to illustrate the signilicant and effective impact of this new parameter on the particle swarm optimizer.
متن کاملHybird Particle Swarm Optimizer with Mass Extinction
A hybrid particle swarm optimizer with mass extinction, which has been suggested to be an important mechanism for evolutionary progress in biological world, is presented to enhance the capacity in reaching optimal solution. The testing results of three benchmark functions that typically used in evolutionary optimization research indicate this method improves the performance effectively.
متن کاملStretching technique for obtaining global minimizers through Particle Swarm Optimization
The Particle Swarm Optimizer, like many other evolutionary and classical minimization methods, su ers the problem of occasional convergence to local minima, especially in multimodal and scattered landscapes. In this work we propose a modi cation of the Particle Swarm Optimizer that makes use of a new technique, named Function \Stretching", to alleviate the local minima problem. Function \Stretc...
متن کاملEvolutionary Algorithms Performance Comparison For Optimizing Unimodal And Multimodal Test Functions
Many evolutionary algorithms have been presented in the last few decades, some of these algorithms were sufficiently tested and used in many researches and papers, such as: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution Algorithm (DEA). Other recently proposed algorithms were unknown and rarely used such as Stochastic Fractal Search (SFS), Symbiotic Organi...
متن کاملAdaptive Particle Swarm Optimizer: Response to Dynamic Systems through Rank-based Selection
A response method to dynamic changes based on evolutionary computation is proposed for the particle swarm optimizer. The method uses rank-based selection to replace half of the lower fitness population with the higher fitness population, when changes are detected. Time-varying values for the acceleration coefficients are proposed to keep a higher degree of global search and a lower degree of lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013